A Planning Approach to Deal with Numeric Variables in Multiobjective Planning

نویسندگان

  • Antonio Garrido
  • Derek Long
چکیده

Planning problems have been traditionally expressed by a propositional representation. However, this representation is not adequate to express numeric variables when modeling realworld continuous resources, such as fuel consumption, energy level, profit, etc. This paper presents our ongoing work to build a planner with capabilities for numeric variables, including duration on actions, and multiobjective optimisation to manage level 3 durative actions of PDDL2.1. Our approach consists of two stages. First, a spike construction process estimates the values of the variables associated to propositions/actions. Unlike other approaches, we do not relax numeric effects in the calculus of the estimation, but only numeric conditions. Second, a heuristic search process generates a relaxed plan according to the estimations of the first stage, and then performs search in a plan space. The relaxed plan and the heuristic estimations help the process find a plan while trying to optimise the multiobjective criterion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planning with Numeric Varibles in Multiobjective Planning

The purely propositional representation traditionally used to express AI planning problems is not adequate to express numeric variables when modeling real-world continuous resources. This paper presents a heuristic planning approach that uses a richer representation with capabilities for numeric variables, including durations of actions, and multiobjective optimisation. The approach consists of...

متن کامل

Numeric Planning via Search Space Abstraction

Many real-world planning problems are best modeled as infinite search space problems, using numeric fluents. Unfortunately, most planners and planning heuristics do not directly support such fluents. We propose a search space abstraction technique that compiles a planning problem with numeric fluents into a finite state propositional planning problem. To account for the loss of precision result...

متن کامل

Interval Based Relaxation Heuristics for Numeric Planning with Action Costs

Many real-world problems can be expressed in terms of states and actions that modify the world to reach a certain goal. Such problems can be solved by automated planning. Numeric planning supports numeric quantities such as resources or physical properties in addition to the propositional variables from classical planning. We approach numeric planning with heuristic search and introduce adaptat...

متن کامل

Numeric state variables in constraint

We extend a planning algorithm to cover simple forms of arithmetics. The operator preconditions can refer to the values of numeric variables and the operator postconditions can modify the values of numeric variables. The basis planning algorithm is based on techniques from propositional satissability testing and does not restrict to forward or backward chaining. When several operations aaect a ...

متن کامل

Reactive Planning Simulation in Dynamic Environments with VirtualRobot

This paper describes the architecture of a reactive planning system for dynamic environments, which is specifically designed to deal with robot planning problems. The architecture permits many agents to work simultaneously on the same environment and it is aimed at working with incomplete information. Agents have partial knowledge about the world and data soon becomes obsolete because of the ch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004